Computational Properties of Qualitative Spatial Reasoning: First Results

While the computational properties of qualitative temporal reasoning have been analyzed quite thoroughly, the computational properties of qualitative spatial reasoning are not very well investigated. In fact, almost no completeness results are known for qualitative spatial calculi and no computational complexity analysis has been carried out yet. In this paper, we will focus on the so-called RCC approach and use Bennett's encoding of spatial reasoning in intuitionistic logic in order to show that consistency checking for the topological base relations can be done eeciently. Further, we show that path-consistency is suucient for deciding global consistency. As a side-eeect we prove a particular fragment of propositional intuitionistic logic to be tractable.